Completeness and Definability in the Logic of Noncontingency

نویسنده

  • Evgeny Zolin
چکیده

Hilbert-style axiomatic systems are presented for versions of the modal logics KΣ, where Σ ⊆ {D,4,5}, with non-contingency as the sole modal primitive. The classes of frames characterized by the axioms of these systems are shown to be first-order definable, though not equal to the classes of serial, transitive, or euclidean frames. The canonical frame of the non-contingency logic of any logic containing the seriality axiom is proved to be non-serial. It is also shown that any class of frames definable in the non-contingency language contains the class of functional frames, and dually, there exists a greatest consistent normal non-contingency logic.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Logics of Strong Noncontingency

Inspired by Hintikka’s treatment of question embedding verbs in [8] and the variations of noncontingency operator, we propose a logic with strong noncontingency operator N as the only primitive modality. A proposition is strongly noncontingent, if no matter whether it is true or false, it does it necessarily; otherwise, it is weakly contingent. This logic is not a normal modal logic, since N(φ ...

متن کامل

Almost Necessary

A formula is contingent if it is possibly true and possibly false. A formula is noncontingent if it is not contingent, i.e., if it is necessarily true or necessarily false. In an epistemic setting, ‘a formula is contingent’ means that you are ignorant about its value, whereas ‘a formula is non-contingent’ means that you know whether it is true. Although non-contingency is definable in terms of ...

متن کامل

Equality propositional logic and its extensions

We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...

متن کامل

Truth Values and Connectives in Some Non-Classical Logics

The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...

متن کامل

On Completeness and Cocompleteness in an Around Small Categories

The simple connection of completeness and cocompleteness of lattices grows in categories into the Adjoint Functor Theorem. The connection of completeness and cocompleteness of Boolean algebras-even simpler -is similarly related to Par& Theorem for toposes. We explain these relations, and then study the fibrational versions of both these theorems for small complete categories. They can be interp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Notre Dame Journal of Formal Logic

دوره 40  شماره 

صفحات  -

تاریخ انتشار 1999